A Minimum Reconfiguration Probability Routing Algorithm for RWA in All-Optical Networks

نویسندگان

  • Mohan Kumar S.
  • S. N. Jagadeesha
چکیده

In this paper, we present a detailed study of Minimum Reconfiguration Probability Routing (MRPR) algorithm, and its performance evaluation in comparison with Adaptive unconstrained routing (AUR) and Least Loaded routing (LLR) algorithms. We have minimized the effects of failures on link and router failure in the network under changing load conditions, we assess the probability of service and number of light path failures due to link or route failure on Wavelength Interchange(WI) network. The computation complexity is reduced by using Kalman Filter(KF) techniques. The minimum reconfiguration probability routing (MRPR) algorithm selects most reliable routes and assign wavelengths to connections in a manner that utilizes the light path(LP) established efficiently considering all possible requests.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks

Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of  regeneration capabilities, the physical layer i...

متن کامل

Routing in all optical networks using recursive state space technique

In this papr, we have minimized the effects of failures on network performace, by using suitable Routing and Wavelenghth Assignment(RWA) method without disturbing other performance criteria such as blocking probability(BP) and network management(NM). The computation complexity is reduced by using Kalaman Filter(KF) techniques. The minimum reconfiguration probability routing (MRPR) algorithm mus...

متن کامل

Wavelength converter placement under different RWA algorithms in wavelength-routed all-optical networks

Sparse wavelength conversion and appropriate routing and wavelength assignment (RWA) algorithms are the two key factors in improving the blocking performance in wavelength-routed all-optical networks. It has been shown that the optimal placement of a limited number of wavelength converters in an arbitrary mesh network is an NP-complete problem. There have been various heuristic algorithms propo...

متن کامل

Routing and Wavelength Assignment in All-Optical Networks with Multicast Traffic

In this paper, we consider the Routing and Wavelength Assignment (RWA) problem in all-optical wavelength-routing networks with multicast traac. The RWA problem has been proved NP-hard. Many researchers are working on this problem and many algorithms have been proposed to solve the RWA problem. However, most of these algorithms only consider unicast traac, while with multicast traac, the blockin...

متن کامل

A Survey: Sparse Traffic Grooming and RWA Assignment Schemes in Optical Network

Traffic Grooming has become a very important issue on optical Network, as optical networks provide a very high speed data transmission for huge amount of data. A Sparse grooming Network with only a fractional of nodes having grooming functionalities may achieve the same performance as the one in which all the nodes are grooming, but with much lower cost. In literature different algorithms, mode...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1701.05983  شماره 

صفحات  -

تاریخ انتشار 2017